Dynamic minimization of OKFDDs
نویسندگان
چکیده
We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Our approach is based on dynamic variable ordering and decomposition type choice. For changing the decomposition type we use a new method. We brieey discuss the implementation of PUMA, our OKFDD package. The quality of our methods in comparison with sifting and interleaving for OBDDs is demonstrated based on experiments performed with PUMA.
منابع مشابه
Frankfurt am Main , March 1995 Dynamic Minimization of OKFDDs
We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Our approach is based on dynamic variable ordering and decomposition type choice. For changing the decomposition type we use a new more eecient method. The quali...
متن کاملMinimization of OKFDDs by Genetic Algorithms
A Genetic Algorithm (GA) is applied to minimize the size of Ordered Kronecker Functional Decision Diagrams (OKFDDs). Our approach chooses a good variable ordering and decomposition type list in parallel. We apply our minimization algorithm to technology mapping for FPGAs. Experimental results are given to show the eeciency of our approach.
متن کاملLearning heuristics for OKFDD minimization by evolutionary algorithms
| Ordered Kronecker Functional Decision Diagrams (OKFDDs) are a data structure for e cient representation and manipulation of Boolean functions. OKFDDs are very sensitive to the chosen variable ordering and the decomposition type list, i.e. the size may vary from linear to exponential. In this paper we present an Evolutionary Algorithm (EA) that learns good heuristics for OKFDD minimization sta...
متن کاملA Genetic Algorithm for the Construction of Small and Highly Testable OKFDD-Circuits
A Genetic Algorithm (GA) is applied to derive circuits that combine area eeciency and testability. These circuits are obtained from Ordered Kronecker Functional Decision Diagrams (OKFDDs). In \Becker and Drechsler (1995)" a heuristic approach has been presented. In this paper we show how these results can further be improved by GAs. Finally , we apply our minimization algorithm to technology ma...
متن کاملOn Variable Ordering and Decomposition Type Choice in OKFDDs
| We present methods for the construction of small Ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of Ordered Binary Decision Diagrams (OBDDs) and Ordered Functional Decision Diagrams (OFDDs) as well. Starting with an upper bound for the size of an OKFDD representing a tree-like circuit we develope diierent heuristics to nd good variable orderings and decomp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995